Performance of hyperplane ordering on vector computers
نویسندگان
چکیده
منابع مشابه
Orthogonal Reduction on Vector Computers
This paper concerns the implementation of the QR factorization by Givens and Householder transformations on vector computers . Following the analysis of Dongarra, et al. [1984] for Gaussian elimination, various ijk forms for both Givens and Householder transformations are investigated. Conclusions concerning which of these forms have desirable or undesirable properties for vector computers are ...
متن کاملthe effects of planning on accuracy and complexity of iranian efl students’ written narrative task performance
this study compared the different effects of form-focused guided planning vs. meaning-focused guided planning on iranian pre-intermediate students’ task performance. the study lasted for three weeks and concentrated on eight english structures. forty five pre-intermediate iranian students were randomly assigned to three groups of guided planning focus-on-form group (gpfg), guided planning focus...
15 صفحه اولthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
Normal Vector of a Random Hyperplane
Let v1, . . . ,vn−1 be n − 1 independent vectors in R (or C). We study x, the unit normal vector of the hyperplane spanned by the vi. Our main finding is that x resembles a random vector chosen uniformly from the unit sphere, under some randomness assumption on the vi. Our result has applications in random matrix theory. Consider an n×n random matrix with iid entries. We first prove an exponent...
متن کاملAtomistic Simulations on Scalar and Vector Computers
Large scale atomistic simulations are feasible only with classical effective potentials. Nevertheless, even for classical simulations some ab-initio computations are often necessary, e.g. for the development of potentials or the validation of the results. Ab-initio and classical simulations use rather different algorithms and make different requirements on the computer hardware. We present perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1991
ISSN: 0377-0427
DOI: 10.1016/0377-0427(91)90165-g